Cofinal Types of Topological Directed Orders

نویسنده

  • STEVO TODORCEVIC
چکیده

We investigate the structure of the Tukey ordering among directed orders arising naturally in topology and measure theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Cofinal Types of Definable Directed Orders

We study the cofinal diversity of analytic p-ideals and analytic relative σ-ideals of compact sets. We prove that the σ-ideal of compact meager sets is not cofinally simpler than the asymptotic density zero ideal; this concludes the study of the cofinal types of classical analytic ideals. We obtain this result by using a Ramsey-type partition calculus, which allows us to capture the relevant co...

متن کامل

Directed Sets and Cofinal Types

We show that 1, w, ax, u x ux and ["iF" are the only cofinal types of directed sets of size S,, but that there exist many cofinal types of directed sets of size continuum. A partially ordered set D is directed if every two elements of D have an upper bound in D. In this note we consider some basic problems concerning directed sets which have their origin in the theory of Moore-Smith convergence...

متن کامل

The topological ordering of covering nodes

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

متن کامل

An Efficient Method of Indexing All Topological Orders for a Given DAG

Topological orders of a directed graph are an important concept of graph algorithms. The generation of topological orders is useful for designing graph algorithms and solving scheduling problems. In this paper, we generate and index all topological orders of a given graph. Since topological orders are permutations of vertices, we can use the data structure πDD, which generates and indexes a set...

متن کامل

Some Equivalences for Martin’s Axiom in Asymmetric Topology

We find some statements in the language of asymmetric topology and continuous partial orders which are equivalent to the statements κ < m or κ < p. We think of asymmetric topology as those parts of topology in which the specialization order, x ≤ y if and only if x ∈ c{y}, need not be symmetric. (See [5] for some of the motivations.) Martin’s Axiom has many equivalent statements, consequences, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004